A Linear-Time Self-Stabilizing Algorithm for the Minimal 2-Dominating Set Problem in General Networks

نویسندگان

  • Tetz C. Huang
  • Chih-Yuan Chen
  • Cheng-Pin Wang
چکیده

Kamei and Kakugawa have recently proposed a self-stabilizing algorithm for the minimal k-dominating set problem. Their algorithm is a general form of the maximalindependent-set algorithm proposed by Shukla et al. The results in their paper are for any tree network that assumes Dijkstra’s central demon model. In particular, the worstcase stabilization time is claimed to be O(n), where n is the number of nodes in the system. In this paper, we generalize their results for the case k = 2. We show that their algorithm with k = 2, when operating in any general network, is self-stabilizing under the central demon model, and solves the minimal 2-dominating set problem. We also derive that the worst-case stabilization time is linear, i.e., O(n). A bounded function technique is employed in obtaining these results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-Stabilizing Algorithm for Finding a Minimal Positive Influence Dominating Set in Social Networks

Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas. Motivated by applications in social networks (such as alcohol intervention strategies), a variation of the dominating set called a positive influence dominating set (PIDS) has been studied in the literature. However, the ...

متن کامل

A Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems

The study of various dominating set problems is an important area within graph theory. In applications, a dominating set in a system can be considered as an ideal place for allocating resources. And, a minimal dominating set allows allocating a smaller number of resources. Distance-versions of the concept of minimal dominating sets are more applicable to modeling real-world problems, such as pl...

متن کامل

Time- and space-efficient self-stabilizing algorithms

In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Self-stabilization is a general approach to make a distributed system tolerate arbitrary transient faults by design. A self-stabilizing algor...

متن کامل

A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph

In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph.

متن کامل

A Self-Stabilizing O(k)-Time k-Clustering Algorithm

A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with unique IDs and no designated leader. The algorithm is comparison-based, takes O(k) time and uses O(k logn) space per process, where n is the size of the network. It is known that finding a minimal k-dominating set is NP-har...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2008